Optimal Riemannian distances preventing mass transfer

نویسندگان

  • Giuseppe BUTTAZZO
  • Andrea DAVINI
  • Fabricio MACIÀ
چکیده

We consider an optimization problem related to mass transportation: given two probabilities f and f− on an open subset Ω ⊂ R , we let vary the cost of the transport among all distances associated with conformally flat Riemannian metrics on Ω which satisfy an integral constraint (precisely, an upper bound on the L-norm of the Riemannian coefficient). Then, we search for an optimal distance which prevents as much as possible the transfer of f into f−: higher values of the Riemannian coefficient make the connection more difficult, but the problem is non-trivial due to the presence of the integral constraint. In particular, the existence of a solution is a priori guaranteed only on the relaxed class of costs, which are associated with possibly non-Riemannian Finsler metrics. Our main result shows that a solution does exist in the initial class of Riemannian distances. 2000MSC : 49J45, 53C60.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal control, geometry, and quantum computing

We prove upper and lower bounds relating the quantum gate complexity of a unitary operation, U, to the optimal control cost associated to the synthesis of U. These bounds apply for any optimal control problem, and can be used to show that the quantum gate complexity is essentially equivalent to the optimal control cost for a wide range of problems, including time-optimal control and finding min...

متن کامل

Proximal Point Method for a Class of Bregman Distances on Riemannian Manifolds

This paper generalizes the proximal point method using a class of Bregman distances to solve convex and quasiconvex optimization problems on complete Riemannian manifolds. We will prove, under standard assumptions, that the sequence generated by our method is well defined and converges to an optimal solution of the problem. Also, we give some examples of Bregman distances in non-Euclidean spaces.

متن کامل

A Geometry Preserving Kernel over Riemannian Manifolds

Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...

متن کامل

Optimal control in laser-induced population transfer for two- and three-level quantum systems

We apply the techniques of control theory and of sub-Riemannian geometry to laser-induced population transfer in twoand three-level quantum systems. The aim is to induce complete population transfer by one or two laser pulses minimizing the pulse fluences. Sub-Riemannian geometry and singular-Riemannian geometry provide a natural framework for this minimization, where the optimal control is exp...

متن کامل

Differential Geometric Heuristics for Riemannian Optimal Mass Transportation

We give an account on Otto’s geometrical heuristics for realizing, on a compact Riemannian manifold M , the L Wasserstein distance restricted to smooth positive probability measures, as a Riemannian distance. The Hilbertian metric discovered by Otto is obtained as the base metric of a Riemannian submersion with total space, the group of diffeomorphisms of M equipped with the Arnol’d metric, and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005